Derivative-free superiorization with component-wise perturbations
نویسندگان
چکیده
منابع مشابه
Multi-Penalty Regularization with a Component-Wise Penalization
We discuss a new regularization scheme for reconstructing the solution of a linear ill-posed operator equation from given noisy data in the Hilbert space setting. In this new scheme, the regularized approximation is decomposed into several components, which are defined by minimizing a multi-penalty functional. We show theoretically and numerically that under a proper choice of the regularizatio...
متن کاملA Component-wise EM Algorithm for Mixtures
In some situations, EM algorithm shows slow convergence problems. One possible reason is that standard procedures update the parameters simultaneously. In this paper we focus on nite mixture estimation. In this framework, we propose a component-wise EM, which updates the parameters sequentially. We give an interpretation of this procedure as a proximal point algorithm and use it to prove the co...
متن کاملAdaptive Component-wise Multiple-Try Metropolis Sampling
One of the most widely used samplers in practice is the component-wise MetropolisHastings (CMH) sampler that updates in turn the components of a vector spaces Markov chain using accept-reject moves generated from a proposal distribution. When the target distribution of a Markov chain is irregularly shaped, a ‘good’ proposal distribution for one part of the state space might be a ‘poor’ one for ...
متن کاملComponent-Wise Instruction-Cache Behavior Prediction
The precise determination of worst-case execution times (WCETs) for programs is mostly being performed on linked executables, since all needed information and all machine parameters influencing cache performance are available to the analysis. This paper describes how to perform a component-wise prediction of the instruction-cache behavior guaranteeing conservative results compared to an analysi...
متن کاملComputable Component-wise Reducibility | Egor Ianovski
We consider equivalence relations and preorders complete for various levels of the arithmetical hierarchy under computable, component-wise reducibility. We show that implication in first order logic is a complete preorder for Σ1, the ≤m relation on EXPTIME sets for Σ2 and the embeddability of computable subgroups of (Q,+) for Σ3. In all cases, the symmetric fragment of the preorder is complete ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerical Algorithms
سال: 2018
ISSN: 1017-1398,1572-9265
DOI: 10.1007/s11075-018-0524-0